Chinese Keyword Search by Indexing in Relational Databases
نویسندگان
چکیده
منابع مشابه
Efficient Keyword Search in Relational Databases
A user who wants to get knowledge from a relational database that needs to know about structured query languages and database schema. Mostly users are not know to those things, so searching knowledge from relational databases is difficult to them. Where a keyword query input is a simple search model that can be issued by writing a list of keywords values, keyword search that place provide a sol...
متن کاملDISCOVER: Keyword Search in Relational Databases
DISCOVER operates on relational databases and facilitates information discovery on them by allowing its user to issue keyword queries without any knowledge of the database schema or of SQL. DISCOVER returns qualified joining networks of tuples, that is, sets of tuples that are associated because they join on their primary and foreign keys and collectively contain all the keywords of the query. ...
متن کاملPreference-Driven Keyword Search in Relational Databases
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches may return an overwhelming number of results. In this paper, we propose personalizing keyword database search by allowing users to express preferences. User preferences depend on context. Given the context of a keywor...
متن کاملKeyword Search in Relational Databases: A Survey
The integration of DB and IR provides flexible ways for users to query information in the same platform [6, 2, 3, 7, 5, 28]. On one hand, the sophisticated DB facilities provided by RDBMSs assist users to query well-structured information using SQL. On the other hand, IR techniques allow users to search unstructured information using keywords based on scoring and ranking, and do not need users ...
متن کاملIncremental Keyword Search in Relational Databases
Keyword-based search is becoming the standard way to access any kind of information and it is considered today an important add-on of relational database management systems. The approaches to keyword search over relational data usually rely on a two-step strategy in which, first, tree-shaped answers are built by connecting tuples matching the given keywords and, then, potential answers are rank...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2012
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2012.512b021